recursive call

recursive call
рекурсивный вызов
обращение к подпрограмме из неё самой (прямая рекурсия) или из вызванной ею подпрограммы (косвенная рекурсия)

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "recursive call" в других словарях:

  • recursive call — rekursinis kreipinys statusas T sritis informatika apibrėžtis Procedūros arba funkcijos kreipimasis į ją pačią. atitikmenys: angl. recursive call ryšiai: dar žiūrėk – rekursija …   Enciklopedinis kompiuterijos žodynas

  • recursive subprogram — or recursive subroutine noun (computing) One which includes among its program statements a call to the subprogram itself • • • Main Entry: ↑recur …   Useful english dictionary

  • recursive subroutine — recursive subprogram or recursive subroutine noun (computing) One which includes among its program statements a call to the subprogram itself • • • Main Entry: ↑recur …   Useful english dictionary

  • Call stack — In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program. This kind of stack is also known as an execution stack, control stack, run time stack, or machine stack, and… …   Wikipedia

  • Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… …   Wikipedia

  • Recursive ordinal — In mathematics, specifically set theory, an ordinal α is said to be recursive if there is a recursive binary relation R that well orders a subset of the natural numbers and the order type of that ordering is α. It is trivial to check that ω is… …   Wikipedia

  • Call graph — A call graph (also known as a call multigraph) is a directed graph that represents calling relationships between subroutines in a computer program. Specifically, each node represents a procedure and each edge (f,g) indicates that procedure f… …   Wikipedia

  • recursive function — noun a) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm b) Any function that uses recursion and can call itself until a certain condition is met …   Wiktionary

  • recursive routine — noun a routine that can call itself • Hypernyms: ↑routine, ↑subroutine, ↑subprogram, ↑procedure, ↑function …   Useful english dictionary

  • Tail recursive — Eine rekursive Funktion f ist endrekursiv (englisch: tail recursive) (auch endständig rekursiv, iterativ rekursiv, repetitiv rekursiv), wenn der rekursive Funktionsaufruf die letzte Aktion zur Berechnung von f ist.[1] Vorteil dieser… …   Deutsch Wikipedia

  • Tail call elimination — Eine rekursive Funktion f ist endrekursiv (englisch: tail recursive) (auch endständig rekursiv, iterativ rekursiv, repetitiv rekursiv), wenn der rekursive Funktionsaufruf die letzte Aktion zur Berechnung von f ist.[1] Vorteil dieser… …   Deutsch Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»